Noyau de Cauchy-Szegö d'un espace symétrique de type Cayley

Complexité en espace de l'exploration de graphes

Graph Exploration is a problem motivated by several aspects of theoretical computer science, including logic and computational complexity. It has also numerous applications in robotics. In all these contexts, the amount of memory used by the mobile entity (robot, finite automaton, etc.) performing exploration is a key parameter. In this thesis, we study in depth the space complexity of graph ex...

Mesure de similarité de graphes par noyau de sacs de chemins

A common approach for classifying shock graphs is to use a dissimilarity measure on graphs and a distance based classifier. In this paper, we propose the use of kernel functions for data mining problems on shock graphs. The first contribution of the paper is to extend the class of graph kernel by proposing kernels based on bag of paths. Then, we propose a methodology for using these kernels for...

Grammaire de Ramanujan et arbres de Cayley

— We study three sequences of polynomials defined as successive derivatives with respect to a differential operator associated with a grammar (one of these sequences was originally introduced by Ramanujan). Combinatorial interpretations for these polynomials are found in terms of rooted trees and graphs of mappings from [n] to [n]. Introduction Dans [Ra], [B], Ramanujan (et B. Berndt à sa suite...

Reconnaissance de locuteurs par localisation dans un espace de locuteurs de référence

Etude serologique comparée de différentes souches de virus aphteux de type A isolées au Moyen-Orient et en Europe